GSTE is partitioned model checking

GSTE Is Partitioned Model Checking

Verifying whether an ω-regular property is satisfied by a finite-state system is a core problem in model checking. Standard techniques build an automaton with the complementary language, compute its product with the system, and then check for emptiness. Generalized symbolic trajectory evaluation (GSTE) has been recently proposed as an alternative approach, extending the computationally efficien...

Symbolic Model Checking with Partitioned Transistion Relations

A new algorithm for Partitioned Model Checking

State space partitioning-based approaches have been proposed in the literature to address the state-space explosion problem in model checking. These approaches, whether sequential or distributed, perform a large amount of work in the form of inter-partition (cross-over) image computations, which can be expensive. We present a model checking algorithm that aggregates these expensive cross-over i...

Efficient Symbolic Model Checking using Partitioned-OBDDs

This paper presents an efficient method to avoid memory explosion in symbolic model checking through the use of Partitioned-OBDDs (POBDDs). The partitioned approach requires only one partition to be in memory at any time and allows for differing variable orders to be used in the partitions. We present new algorithms for checking invariants and for model checking CTL formulas expressible as leas...

Symbolic Model Checking with Partitioned Transition Relations

We signiicantly reduce the complexity of BDD-based symbolic veriication by using partitioned transition relations to represent state transition graphs. This method can be applied to both synchronous and asynchronous circuits. The times necessary to verify a synchronous pipeline and an asynchronous stack are both bounded by a low polynomial in the size of the circuit. We were able to handle stac...